'''Project Euler Problem 206

Find a unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,
where each "_" is a single digit.
'''
import time
import math

# totally brute force with some inital paring.
runfor = 100000 # 1/3000 the actual time a.k.a seconds = hours.
minsq = math.floor(math.sqrt(int('1%i2%i3%i4%i5%i6%i7%i8%i9%i0' % ((0,) * 9))))
maxsq = math.ceil(math.sqrt(int('1%i2%i3%i4%i5%i6%i7%i8%i9%i0' % ((9,) * 9))))

print "Solution is between %i and %i (%i possible canidates)." % (minsq, maxsq, maxsq-minsq+1)
print '------\n Beginning test....'
begin = time.clock()


